2-connected graphs with small 2-connected dominating sets
نویسندگان
چکیده
منابع مشابه
2-connected Graphs with Small 2-connected Dominating Sets
Let G be a 2-connected graph. A subset D of V (G) is a 2-connected dominating set if every vertex of G has a neighbor in D and D induces a 2-connected subgraph. Let γ2(G) denote the minimum size of a 2-connected dominating set of G. Let δ(G) be the minimum degree of G. For an n-vertex graph G, we prove that γ2(G) ≤ n ln δ(G) δ(G) (1 + oδ(1)) where oδ(1) denotes a function that tends to 0 as δ →...
متن کاملConnected dominating sets on dynamic geometric graphs
We propose algorithms for efficiently maintaining a constant-approximate minimum connected dominating set (MCDS) of a geometric graph under node insertions and deletions. Assuming that two nodes are adjacent in the graph iff they are within a fixed geometric distance, we show that an O(1)-approximate MCDS of a graph in R d with n nodes can be maintained with polylogarithmic (in n) work per node...
متن کاملConnected odd dominating sets in graphs
An odd dominating set of a simple, undirected graph G = (V,E) is a set of vertices D ⊆ V such that |N [v]∩D| ≡ 1 mod 2 for all vertices v ∈ V . It is known that every graph has an odd dominating set. In this paper we consider the concept of connected odd dominating sets. We prove that the problem of deciding if a graph has a connected odd dominating set is NP-complete. We also determine the exi...
متن کاملConnected Dominating Sets
PROBLEM DEFINITION Consider a graph G = (V,E). A subset C of V is called a dominating set if every vertex is either in C or adjacent to a vertex in C. If, furthermore, the subgraph induced by C is connected, then C is called a connected dominating set. A connected dominating set with a minimum cardinality is called a minimum connected dominating set (MCDS). Computing a MCDS is an NP-hard proble...
متن کاملConnected Dominating Sets
Wireless sensor networks (WSNs), consist of small nodes with sensing, computation, and wireless communications capabilities, are now widely used in many applications, including environment and habitat monitoring, traffic control, and etc. Routing in WSNs is very challenging due to the inherent characteristics that distinguish these networks from other wireless networks like mobile ad hoc networ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2003
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00055-4